Non-Commutative Resistance Networks
نویسندگان
چکیده
In the setting of finite-dimensional C∗-algebras A we define what we call a Riemannian metric for A, which when A is commutative is very closely related to a finite resistance network. We explore the relationship with Dirichlet forms and corresponding seminorms that are Markov and Leibniz, with corresponding matricial structure and metric on the state space. We also examine associated Laplace and Dirac operators, quotient energy seminorms, resistance distance, and the relationship with standard deviation.
منابع مشابه
On the commuting graph of non-commutative rings of order $p^nq$
Let $R$ be a non-commutative ring with unity. The commuting graph of $R$ denoted by $Gamma(R)$, is a graph with vertex set $RZ(R)$ and two vertices $a$ and $b$ are adjacent iff $ab=ba$. In this paper, we consider the commuting graph of non-commutative rings of order pq and $p^2q$ with Z(R) = 0 and non-commutative rings with unity of order $p^3q$. It is proved that $C_R(a)$ is a commutative ring...
متن کاملLinear Network Coding Over Rings - Part II: Vector Codes and Non-Commutative Alphabets
In Part I, we studied linear network coding over finite commutative rings and made comparisons to the wellstudied case of linear network coding over finite fields. Here, we consider the more general setting of linear network coding over finite (possibly non-commutative) rings and modules. We prove the following results regarding the linear solvability of directed acyclic networks over various f...
متن کاملOn the commuting graph of some non-commutative rings with unity
Let $R$ be a non-commutative ring with unity. The commuting graph of $R$ denoted by $Gamma(R)$, is a graph with a vertex set $Rsetminus Z(R)$ and two vertices $a$ and $b$ are adjacent if and only if $ab=ba$. In this paper, we investigate non-commutative rings with unity of order $p^n$ where $p$ is prime and $n in lbrace 4,5 rbrace$. It is shown that, $Gamma(R)$ is the disjoint ...
متن کاملDirected prime graph of non-commutative ring
Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$. Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...
متن کاملAuthentication Schemes Using Polynomials Over Non-Commutative Rings
Authentication is a process by which an entity, which could be a person or intended computer, establishes its identity to another entity. In private and public computer networks including the Internet, authentication is commonly done through the use of logon passwords. Knowledge of the password is assumed to guarantee that the user is authentic. Internet business and many other transactions req...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014